A two-stage robust hub location problem with accelerated Benders decomposition algorithm

In this paper, a two-stage robust optimisation is presented for an uncapacitated hub location problem in which demand uncertain and the level of conservatism controlled by uncertainty budget. first stage, locations establishing facilities were determined, allocation decisions made second stage. An accelerated Benders decomposition algorithm was used to solve problem. Computational experiments showed better results terms number iterations computation time with Pareto-optimal cuts comparison classical algorithm. According numerical analysis, it concluded that increasing budget also increased total costs more established hubs. To determine appropriate manner, new expected aggregate function introduced. The studies demonstrated usefulness proposed method defining presence uncertainty.